Analysis of Saturated Belief Propagation Decoding of Low-Density Parity-Check Codes
نویسندگان
چکیده
منابع مشابه
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two al...
متن کاملIterative Decoding beyond Belief Propagation of Low-density Parity-check Codes
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
متن کاملIterative Decoding of Low-Density Parity Check Codes (A Survey)
Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...
متن کاملIterative reliability-based decoding of low-density parity check codes
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagatio...
متن کاملSoft Bit Decoding of Low Density Parity Check Codes
A novel soft-bit-domain decoding algorithm for low-density parity-check codes is derived as an alternative to belief propagation and min-sum algorithms. A simple approximation analogous to the min-sum approximation is also presented. Simulation results demonstrating the functionality of the algorithm are given both for floating and fixed point representations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2723484